Mobility in granular materials upon cyclic loading

We investigate the ability to move of large objects—referred to as intruders—embedded in a granular material and subjected to cyclic loadings. A discrete element method is used to simulate the dynamics response of intruders subjected to a vertical uplift cyclic force, exploring a wide range of loading magnitudes and frequencies. The analysis of the intruder and grains displacements over many cycles reveals three mobility regimes. In the first two regimes, called confined and failure the intruder either do not significantly move or consistently moves upward after each cycles. We introduce a physically based model considering an inertial drag force to rationalise the existence of these regimes depending on the loading frequency and magnitude. We further evidence a third intermediate regime of creep, where intruder trajectories exhibit long periods of confinement punctuated by shorter periods of sustained uplift motion. Finally, we observe unexpected failures at low loading magnitudes and specific frequencies, which we attribute to a process of elasto-inertial resonance. These results highlight the important differences in the mobility of intruders upon constant and cyclic loadings.     

A semantics of introspection in a reflective prototype-based language

In Malenfant et al. [19], we have described a reflective model for a prototype-based language based on thelookup o apply reflective introspection protocol. In this paper, we augment our previous protocol by converting it to handle continuations reified as first-class objects. First-class continuations provide much more control over the current computation; during the introspection phase fired by message sending, they make it possible not only to change the behavior of the program for that message but also for the entire future computation. In this paper, we provide this introspection protocol with a formal semantics. This result is obtained by exhibiting a mapping from program configurations to priority rewrite systems (PRS) as well as a mapping from message expressions to ground first-order terms used to query the PRS. Other advantages of this approach are: to ensure the termination of the introspection using the smallest set of formally justified conditions and to provide a clear declarative account of this reflective protocol. The PRS also appears as a meta-level to the base language, independent of the implementation, but from which we derive fundamental clues to obtain an efficient language processor. By our new model, we finally highlight the link between reflection in object-oriented languages and the one originally proposed by 3-Lisp [24], although object-orientation provides reusability to reflection, making it easier to use.     

Cost optimization of a hybrid composite flywheel rotor with a split-type hub using combined analytical/numerical models

A procedure to find the optimal design of a flywheel with a split-type hub is presented. Since cost plays a decisive role in stationary flywheel energy storage applications, a trade-off between energy and cost is required. Applying a scaling technique, the multi-objective design problem is reduced to the maximization of the energy-per-cost ratio as the single objective. Both an analytical and a finite element model were studied. The latter was found to be more than three orders of magnitude more computationally expensive than the analytical model, while the analytical model can only be regarded as a coarse approximation. Multifidelity approaches were examined to reduce the computational expense while retaining the high accuracy and large modeling depth of the finite element model. Using a surrogate-based optimization strategy, the computational cost was reduced to only one third in comparison to using only the finite element model. A nonlinear interior-point method was employed to find the optimal rim thicknesses and rotational speed. The benefits of the split-type hub architecture were demonstrated.     

A conceptual framework to define the spatial resolution requirements for agricultural monitoring using remote sensing

Satellite remote sensing is an invaluable tool to monitor agricultural resources. However, spatial patterns in agricultural landscapes vary significantly across the Earth resulting in different imagery requirements depending on what part of the globe is observed. Furthermore, there is an increasing diversity of Earth observation instruments providing imagery with various configurations of spatial, temporal, spectral and angular resolutions. In terms of spatial resolution, the choice of imagery should be conditioned by knowing the appropriate spatial frequency at which the landscape must be sampled with the imaging instrument in order to provide the required information from the targeted fields. This paper presents a conceptual framework to define quantitatively such requirements for both crop area estimation and crop growth monitoring based on user-defined constraints. The methodological development is based on simulating how agricultural landscapes, and more specifically the fields covered by a crop of interest, are seen by instruments with increasingly coarser resolving power. The results are provided not only in terms of acceptable pixel size but also of pixel purity which is the degree of homogeneity with respect to the target crop. This trade-off between size and purity can be adjusted according to the end-user's requirements. The method is implemented over various agricultural landscapes with contrasting spatial patterns, demonstrating its operational applicability. This diagnostic approach can be used: (i) to guide users in choosing the most appropriate imagery for their application, (ii) to evaluate the adequacy of existing remote sensing systems for monitoring agriculture in different regions of the world and (iii) to provide guidelines for space agencies to design future instruments dedicated to agriculture monitoring.     

Nonsmooth µ‐synthesis

We revisit robust complex‐ and mixed‐ µ‐synthesis problems based on upper bounds and show that they can be recast as specially structured controller design programs. The proposed reformulations suggest a streamlined handling of µ‐synthesis problems using recently developed (local) nonsmooth optimization methods, where both scalings or multipliers and a controller of given structure are obtained simultaneously. A first cut of the nonsmooth programming software for structured H_∞ synthesis is made available through the MATLAB R2010b Prerelease, Robust Control Toolbox Version 3.5 developed by The MathWorks, Inc. Copyright © 2010 John Wiley & Sons, Ltd.     

On testing for serial correlation of unknown form using wavelet thresholding

Omnibus procedures for testing serial correlation are developed, using spectral density estimation and wavelet shrinkage. The asymptotic distributions of the wavelet coefficients under the null hypothesis of no serial correlation are derived. Under some general conditions on the wavelet basis, the wavelet coefficients asymptotically follow a normal distribution. Furthermore, they are asymptotically uncorrelated. Adopting a spectral approach and using results on wavelet shrinkage, new one-sided test statistics are proposed. As a spatially adaptive estimation method, wavelets can effectively detect fine features in the spectral density, such as sharp peaks and high frequency alternations. Using an appropriate thresholding parameter, shrinkage rules are applied to the empirical wavelet coefficients, resulting in a non-linear wavelet-based spectral density estimator. Consequently, the advocated approach avoids the need to select the finest scale J, since the noise in the wavelet coefficients is naturally suppressed. Simple data-dependent threshold parameters are also considered. In general, the convergence of the spectral test statistics toward their respective asymptotic distributions appears to be relatively slow. In view of that, Monte Carlo methods are investigated. In a small simulation study, several spectral test statistics are compared, with respect to level and power, including versions of these test statistics using Monte Carlo simulations.     

Discrepancy search for the flexible job shop scheduling problem

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones.     

Optimal synthesis of planar mechanisms via an extensible-link approach

This paper presents a novel approach to optimize the design of planar mechanisms with revolute joints for function generation or path synthesis. The proposed method is based on the use of an extensible-link mechanism model whose strain energy is minimized to find the optimal rigid design. This enables us to get rid of assembly constraints and the use of natural coordinates makes the objective function simpler. Two optimization strategies are developed and then discussed. The first one relies on alternate optimizations of design parameters and point coordinates. The second one uses multiple partial syntheses as starting point for a full synthesis process. The question of finding the global optimum is also addressed and developed. A simple algorithm is proposed to find several local optima among which the designer may choose the best one taking other criteria into account (e.g. stiffness, collision, size,...). Three applications are presented to illustrate the strategies while mentioning their limits.